Describing data flow analysis techniques with Kleene algebra

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalizing Static Analysis Techniques with Kleene Algebra

Static program analysis consists of compile-time techniques for determining properties of programs without actually running them [1–3]. Among the applications of static program analysis are the optimization by compilers of object code [4] and the detection of malicious code or code that might be maliciously exploited [5, 6]. The obvious relevance and (sometimes critical) importance of such appl...

متن کامل

Synchronous Kleene Algebra vs. Concurrent Kleene Algebra

In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions/programs that have a notion of concurrency in the style of synchrony of the SCCS calculus. CKA has, at first sight,...

متن کامل

Kleene Algebra with Converse

The equational theory generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure was studied by Bernátsky, Bloom, Ésik, and Stefanescu in 1995. We reformulate some of their proofs in syntactic and elementary terms, and we provide a new algorithm to decide the corresponding theory. This algorithm is both simpler and more efficie...

متن کامل

Kleene Algebra with Equations

We identify sufficient conditions for the construction of free language models for systems of Kleene algebra with additional equations. The construction applies to a broad class of extensions of KA and provides a uniform approach to deductive completeness.

متن کامل

Kleene Algebra with Tests

Kleene algebras with tests provide a rigorous framework for equational speciication and veriication. They have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2007

ISSN: 0167-6423

DOI: 10.1016/j.scico.2006.01.009